Intrinsic Simulations between Stochastic Cellular Automata
نویسندگان
چکیده
منابع مشابه
Intrinsic Simulations between Stochastic Cellular Automata
The paper proposes a simple formalism for dealing with deterministic, non-deterministic and stochastic cellular automata in a unifying and composable manner. Armed with this formalism, we extend the notion of intrinsic simulation between deterministic cellular automata, to the non-deterministic and stochastic settings. We then provide explicit tools to prove or disprove the existence of such a ...
متن کاملIntrinsic Simulations between Stochastic Cellular Automata
The paper proposes a simple formalism for dealing with deterministic, non-deterministic and stochastic cellular automata in a unifying and composable manner. Armed with this formalism, we extend the notion of intrinsic simulation between deterministic cellular automata, to the non-deterministic and stochastic settings. We then provide explicit tools to prove or disprove the existence of such a ...
متن کاملStochastic Cellular Automata: Correlations, Decidability and Simulations
This paper introduces a simple formalism for dealing with deterministic, nondeterministic and stochastic cellular automata in an unified and composable manner. This formalism allows for local probabilistic correlations, a feature which is not present in usual definitions. We show that this feature allows for strictly more behaviors (for instance, number conserving stochastic cellular automata r...
متن کاملSimulations between Programs as Cellular Automata
We present cellular automata on appropriate digraphs and show that any covered normal logic program is a cellular automaton. Seeing programs a.s cellular automata. shifts attention from classes of Herbrand models to orbits of Herbra.nd interpretations. Orbits capture both the declarative, model-theoretic meaning of programs a.s well a.s their inferential behavior. Logically and intentionally di...
متن کاملSimulations Between Cellular Automata on Cayley Graphs
We consider cellular automata on Cayley graphs and compare their computational powers according to the architecture on which t h e y work. We show that, if there exists a homomorphism with a nite kernel from a group into another one such that the image of the rst group has a nite index in the second one, then every cellular automaton on the Cayley graph of one of these groups can be uni-formall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2012
ISSN: 2075-2180
DOI: 10.4204/eptcs.90.17